Twenty Years of Rewriting Logic
نویسنده
چکیده
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems.
منابع مشابه
Axiomatic Sharing-via-Labelling
A judicious use of labelled terms makes it possible to bring together the simplicity of term rewriting and the sharing power of graph rewriting: this has been known for twenty years in the particular case of orthogonal first-order systems. The present paper introduces a concise and easily usable axiomatic presentation of sharing-via-labelling techniques that applies to higher-order term rewriti...
متن کاملArchitectural Specification, Exploration and Simulation Through Rewriting-Logic
In recent years Arvind’s Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specified by term rewriting systems are translated into a standard hardware description language for simulation purposes. In this work we present our current investigation on the use of Rewriting-Logic, which is a more powerful th...
متن کاملComparing logics for rewriting: rewriting logic, action calculi and tile logic
The large di*usion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy speci-cation of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems. For each of these ...
متن کاملAutomated Termination Analysis: From Term Rewriting to Programming Languages
Termination is a crucial property of programs. Therefore, techniques to analyze termination automatically are highly important for program verification. Traditionally, techniques for automated termination analysis were mainly studied for declarative programming paradigms such as logic programming and term rewriting. However, in the last years, several powerful techniques and tools have been dev...
متن کاملFive Basic Concepts of Axiomatic Rewriting Theory
In this invited talk, I will review five basic concepts of Axiomatic Rewriting Theory, an axiomatic and diagrammatic theory of rewriting started 25 years ago in a LICS paper with Georges Gonthier and Jean-Jacques Lévy, and developed along the subsequent years into a full-fledged 2-dimensional theory of causality and residuation in rewriting. I will give a contemporary view on the theory, inform...
متن کامل